A Comment on the Averseness of Random Serial Dictatorship to Stochastic Dominance Efficiency
نویسنده
چکیده
Random Serial Dictatorship (RSD) is arguably the most well-known and widely used assignment rule. Although it returns an ex post efficient assignment, Bogomolnaia and Moulin (A new solution to the random assignment problem, J. Econ. Theory 100, 295–328) proved that RSD may not be SD-efficient (efficient with respect stochastic dominance). The result raises the following question: under what conditions is RSD not SD-efficient? We characterize the conditions under which the RSD assignment is not SD-efficient: the RSD assignment is not SD-efficient if and only if an ex post assignment exists that is not SD-efficient. Hence RSD can be viewed as being inherently averse to SD-efficiency.
منابع مشابه
Maximal Recursive Rule: A New Social Decision Scheme
In social choice settings with strict preferences, random dictatorship rules were characterized by Gibbard [1977] as the only randomized social choice functions that satisfy strategyproofness and ex post efficiency. In the more general domain with indifferences, RSD (random serial dictatorship) rules are the well-known and perhaps only known generalization of random dictatorship. We present a n...
متن کاملA Generalization of Probabilistic Serial to Randomized Social Choice
The probabilistic serial rule is one of the most wellestablished and desirable rules for the random assignment problem. We present the egalitarian simultaneous reservation social decision scheme — an extension of probabilistic serial to the more general setting of randomized social choice. We consider various desirable fairness, efficiency, and strategic properties of social decision schemes an...
متن کاملIncentives for Participation and Abstention in Probabilistic Social Choice
Preliminaries • A social decision scheme (SDS) is a function that maps a preference profile to a lottery over the alternatives. Formally, an SDS is a function f : RFN → ∆(A). • An SDS is majoritarian if it only depends on the (unweighted) majority comparisons between alternatives. • We compare lotteries using stochastic dominance (SD). A lottery p is preferred to another lottery q if the expe...
متن کاملStructure and complexity of ex post efficient random assignments
In the random assignment problem, objects are randomly assigned to agents keeping in view the agents’ preferences over objects. A random assignment specifies the probability of an agent getting an object. We examine the structural and computational aspects of ex post efficiency of random assignments. We first show that whereas an ex post efficient assignment can be computed easily, checking whe...
متن کاملStrategy-proof stochastic assignment
I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.07392 شماره
صفحات -
تاریخ انتشار 2016